Suux Trees for Integer Alphabets Revisited
نویسندگان
چکیده
Farach recently gave a linear-time algorithm for constructing suux trees for integer alphabets, which solves a major open problem on index data structures. We present a new and somewhat cleaner algorithm for constructing suux trees for integer alphabets in linear time.
منابع مشابه
Optimal Suffix Tree Construction with Large Alphabets
The suux tree of a string is the fundamental data structure of combinatorial pattern matching. Weiner Wei73], who introduced the data structure, gave an O(n) time algorithm algorithm for building the suux tree of an n character string drawn from a constant size alphabet. In the comparison model, there is a trivial (n log n) time lower bound based on sorting, and Weiner's algorithm matches this ...
متن کاملSuux Binary Search Trees and Suux Arrays
Suux arrays and suux binary search trees are two data structures that have been proposed as alternatives to the classical suux tree to facilitate eecient on-line string searching. Here, we explore the relationship between these two structures. In particular, we present an alternative view of a suux array, with its auxiliary information, as a perfectly balanced suux binary search tree, and descr...
متن کاملA Generalized Suffix Tree and its (Un)expected Asymptotic Behaviors
Suux trees nd several applications in computer science and telecommunications, most notably in algorithms on strings, data compressions and codes. Despite this, very little is known about their typical behaviors. In a probabilistic framework, we consider a family of suux trees { further called b-suux trees { built from the rst n suuxes of a random word. In this family a noncompact suux tree (i....
متن کاملTrie-Based Data Structures for Sequence Assembly
We investigate the application of trie-based data structures, suux trees and suux arrays in the problem of overlap detection in fragment assembly. Both data structures are theoretically and experimentally analyzed on speed and space. By using heuristics, we can greatly reduce the calls to the time-consuming dynamic programming, and have improved the speed of overlap detection up to 1,000 times ...
متن کاملFrom Ukkonen to Mccreight and Weiner: a Unifying View of Linear-time Suux Tree Construction
We review the linear time suux tree constructions by Weiner, McCreight, and Ukkonen. We use the terminology of the most recent algorithm, Ukkonen's online construction, to explain its historic predecessors. This reveals relationships much closer than one would expect, since the three algorithms are based on rather diierent intuitive ideas. Moreover, it completely explains the diierences between...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999